On the Embeddability of Delaunay Triangulations in Anisotropic, Normed, and Bregman Spaces

نویسندگان

  • Guillermo D. Cañas
  • Steven J. Gortler
چکیده

Given a two-dimensional space endowed with a divergence function that is convex in the firstargument, continuously differentiable in the second, and satisfies suitable regularity conditionsat Voronoi vertices, we show that orphan-freedom (the absence of disconnected Voronoi regions)is sufficient to ensure that Voronoi edges and vertices are also connected, and that the dual isa simple planar graph. We then prove that the straight-edge dual of an orphan-free Voronoidiagram (with sites as the first argument of the divergence) is always an embedded triangulation.Among the divergences covered by our proofs are Bregman divergences, anisotropic divergences,as well as all distances derived from strictly convex C1 norms (including the Lp norms with1 < p <∞). While Bregman diagrams of the first kind are simply affine diagrams, and their duals(weighted Delaunay triangulations) are always embedded, we show that duals of orphan-freeBregman diagrams of the second kind are always embedded. 1arXiv:1512.03589v2[cs.CG]9Jan2016

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bregman Voronoi Diagrams: Properties, Algorithms and Applications

The Voronoi diagram of a finite set of objects is a fundamental geometric structure that subdivides the embedding space into regions, each region consisting of the points that are closer to a given object than to the others. We may define many variants of Voronoi diagrams depending on the class of objects, the distance functions and the embedding space. In this paper, we investigate a framework...

متن کامل

Anisotropic Triangulation Methods in Adaptive Image Approximation

Anisotropic triangulations are utilized in recent methods for sparse representation and adaptive approximation of image data. This article first addresses selected computational aspects concerning image approximation on triangular meshes, before four recent image approximation algorithms, each relying on anisotropic triangulations, are discussed. The discussion includes generic triangulations o...

متن کامل

Optimal N-term approximation by linear splines over anisotropic Delaunay triangulations

Anisotropic triangulations provide efficient geometrical methods for sparse representations of bivariate functions from discrete data, in particular from image data. In previous work, we have proposed a locally adaptive method for efficient image approximation, called adaptive thinning, which relies on linear splines over anisotropic Delaunay triangulations. In this paper, we prove asymptotical...

متن کامل

Bregman Voronoi Diagrams

The Voronoi diagram of a finite set of objects is a fundamental geometric structure that subdivides the embedding space into regions, each region consisting of the points that are closer to a given object than to the others. We may define various variants of Voronoi diagrams depending on the class of objects, the distance function and the embedding space. In this paper, we investigate a framewo...

متن کامل

Image Compression with Anisotropic Geodesic Triangulations

We propose a new image compression method based on geodesic Delaunay triangulations. Triangulations are generated by a progressive geodesic meshing algorithm which exploits the anisotropy of images through a farthest point sampling strategy. This seeding is performed according to anisotropic geodesic distances which force the anisotropic Delaunay triangles to follow the geometry of the image. G...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1512.03589  شماره 

صفحات  -

تاریخ انتشار 2015